Multigraph decomposition into stars and into multistars
نویسندگان
چکیده
منابع مشابه
Multigraph decomposition into stars and into multistars
We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed starH =K1,t :We present necessary and sufficient conditions for such a decomposition to exist where t = 2 and prove NP-completeness of the corresponding decision problem for any t 3.We also prove NP-completeness when the edge multiplicity function is not restricted either on the input G or on the ...
متن کاملMultigraph decomposition into multigraphs with two underlying edges
Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H , is probably not feasible if the underlying simple graph of H has three or more edges. We study the case where H consists of two underlying edges. We present necessary and sufficient conditions for H-decomposa...
متن کاملDecomposition of complete multigraphs into stars and cycles
Let k be a positive integer, Sk and Ck denote, respectively, a star and a cycle of k edges. λKn is the usual notation for the complete multigraph on n vertices and in which every edge is taken λ times. In this paper, we investigate necessary and sufficient conditions for the existence of the decomposition of λKn into edges disjoint of stars Sk’s and cycles Ck’s.
متن کاملDecomposing a Multigraph into Split Components
A linear-time algorithm for decomposing a graph into split components is presented. The algorithm uses a new graph transformation technique to gradually transform the given graph so that every split component in it is transformed into a subgraph with very simple structure which can be easily identified. Once the split components are determined, the triconnected components of the graph are easil...
متن کاملDecomposition into open nets
We study the decomposition of an arbitrary Petri net into open nets. This means that shared places can be seen as message channels between components. We show that there exists a unique decomposition into atomic components which can be efficiently computed. We further show that every composition of components yields a component and that every component can be built from atomic components. Final...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2005.03.012